On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices

An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed     

A competitive algorithm in searching for many edges in a hypergraph

We give a competitive algorithm to identify all d defective edges in a hypergraph with d unknown. Damaschke did the d=1 case for 2-graphs, Triesch extended the d=1 case to r-graphs, and Johann did the general d case for 2-graphs. So ours is the first attempt to solve the searching for defective edges problem in its full generality. Further, all the above three papers assumed d known. We give a competitive algorithm where d is unknown.     

Computing strategies for achieving acceptability: A Monte Carlo approach

We consider a trader who wants to direct his or her portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a Monte Carlo algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the functional form of a trading strategy for achieving acceptability. We also prove optimality of the capital obtained. Explicit theoretical evaluations of hedging strategies are extremely difficult, and we avoid the problem by resorting to such computational methods. The main idea is to utilize the finite Vapnik–C?ervonenkis dimension of a class of possible strategies.     

关于离散HJB方程的下解与上解

本文讨论HJB方程上、下解的几个性质,并讨论了从上解出发的一个迭代法的收敛性.     

Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory

Multi-dimensional asymptotically quasi-Toeplitz Markov chains with discrete and continuous time are introduced. Ergodicity and non-ergodicity conditions are proven. Numerically stable algorithm to calculate the stationary distribution is presented. An application of such chains in retrial queueing models with Batch Markovian Arrival Process is briefly illustrated. AMS Subject Classifications Primary 60K25 · 60K20     

Irn(n=2-25)团簇基态结构的遗传算法研究

用遗传算法结合Gupta紧束缚模型势研究了Irn(n=2-25)团簇的基态结构.分析了Irn(n=2-25)团簇的基态结构随团簇尺寸的变化规律.计算结果表明,Irn(n=2-25)团簇的每个原子的平均束缚能和平均第一近邻随团簇尺寸的增加而增大,以总束缚能的二阶差分为判据,Irn(n=2-25)团簇的幻数是4、7、9、13、15、19、23.     

傅里叶变换红外光谱仪遥测污染云团的吸收光谱算法

遥感傅里叶变换红外光谱技术因其具有对污染源作无干扰监测、多组分的同时连续测定、区域性或大范围地区的测量等优点,因而已广泛的应用于遥感测量技术。利用傅里叶变换红外(FTIR)光谱仪远距离探测目标,根据探测的目标源是否充满光谱仪的视场,建立了三种辐射模型。在所建立模型的基础上,选用了D&P公司生产的便携式Model-101型傅里叶变换红外光谱仪,实时探测目标云团和背景,运用差谱法和发射光谱法对探测结果进行了光谱分析,进而得到了扣除背景影响后的目标云团吸收光谱。给出了相应的仿真实验结果示例。实验结果表明,由差谱法得到的结果准确度较好。     

多目标半定规划的加权中心路径法

对于线性型多目标半定规划问题，引进加权中心路径的概念，并利用单目标半定规划的中心路径法，提出了求解多目标半定规划问题的加权中心路径法，先得型对一个叔向量的有效解，然后在此基础上，提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法．     

Pushing Squares Around

We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are allowed to slide along or rotate about one another. That is, we show that any two connected configurations of the same number of modules can be transformed into each other by a sequence of moves so that all intermediate configurations are connected. This settles a conjecture formulated in [6].